Practice Problems (13)

1. Ceil in a Binary Search Tree
2. Floor in a Binary Search Tree
3. Insert a given Node in Binary Search Tree
4. Delete a Node in Binary Search Tree
5. Find K-th smallest/largest element in BST
6. Check if a tree is a BST or BT
7. LCA in Binary Search Tree
8. Construct a BST from a preorder traversal
9. Inorder Successor/Predecessor in BST
10. Merge 2 BST's
11. Two Sum In BST | Check if there exists a pair with Sum K
12. Recover BST | Correct BST with two nodes swapped
13. Largest BST in Binary Tree
    • GeeksforGeeks
    • LeetCode